Optimal Accuracy-Privacy Trade-Off for Secure Computations
نویسندگان
چکیده
منابع مشابه
Optimal Accuracy-Privacy Trade-Off for Secure Multi-Party Computations
The purpose of Secure Multi-Party Computation is to enable protocol participants to compute a public function of their private inputs while keeping their inputs secret, without resorting to any trusted third party. However, opening the public output of such computations inevitably reveals some information about the private inputs. We propose a measure generalising both Rényi entropy and g-entro...
متن کاملEnergy-Privacy Trade-Offs in VLSI Computations
VLSI circuits are open to sidechannel attacks which disclose information about its internal state to an adversary. Privacy is a design attribute to quantify the circuit’s resistance and resilience to sidechannel attacks. There has been some recent work in cryptography to capture the notion of privacy in circuits. Several constructions to transform a circuit into a private circuit have also been...
متن کاملOptimal Utility-Privacy Trade-off with the Total Variation Distance as the Privacy Measure
Three reasons are provided in favour of L-norm as a measure of privacy-leakage: i) It is proved that this measure satisfies post-processing and linkage inequalities that make it consistent with an intuitive notion of a privacy measure; ii) It is shown that the optimal utility-privacy trade-off can be efficiently solved through a standard linear program when Lnorm is employed as the privacy meas...
متن کاملOptimal trade-off for merkle tree traversal
In this paper we describe optimal trade-offs between time and space complexity of Merkle tree traversals with their associated authentication paths, improving on the previous results of M. Jakobsson, T. Leighton, S. Micali, and M. Szydlo [Fractal Merkle tree representation and traversal, in: RSA Cryptographers Track, RSA Security Conference, 2003] and M. Szydlo [Merkle tree traversal in log spa...
متن کاملOptimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
We show optimal Direct Sum result for the one-way entanglement-assisted quantum communication complexity for any relation f ⊆ X × Y × Z. We show: Q(f) = Ω(m · Q(f)), where Q(f), represents the one-way entanglement-assisted quantum communication complexity of f with error at most 1/3 and f⊕m represents m-copies of f . Similarly for the one-way public-coin classical communication complexity we sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2886458